| 翻訳と辞書 |
| degree distribution ： ウィキペディア英語版 |
degree distribution
In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network.
==Definition==
The degree of a node in a network (sometimes referred to incorrectly as the connectivity) is the number of connections or edges the node has to other nodes. If a network is directed, meaning that edges point in one direction from one node to another node, then nodes have two different degrees, the in-degree, which is the number of incoming edges, and the out-degree, which is the number of outgoing edges.
The degree distribution ''P''(''k'') of a network is then defined to be the fraction of nodes in the network with degree ''k''. Thus if there are ''n'' nodes in total in a network and ''n''''k'' of them have degree ''k'', we have ''P''(''k'') = ''n''''k''/''n''.
The same information is also sometimes presented in the form of a ''cumulative degree distribution'', the fraction of nodes with degree greater than or equal to ''k''.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「degree distribution」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|